Conditional Independence Relations Have No Finite Complete Characterization
نویسنده
چکیده
The hypothesis of existence of a nite characterization of conditional{independence relations (CIRs) is refused. This result is shown to be equivalent with the non{existence of a simple deductive system describing relationships among CI{statements (it is certain type of syntactic description). However, under the assumption that CIRs are grasped the existence of a countable characterization of CIRs is shown. Finally, the problem of characterization of CIRs is shown to be diverse from an analogical problem of axiomatization EMVDs arising in the theory of relational databases.
منابع مشابه
Gaussian Conditional Independence Relations Have No Finite Complete Characterization
We show that there can be no finite list of conditional independence relations which can be used to deduce all conditional independence implications among Gaussian random variables. To do this, we construct, for each n > 3 a family of n conditional independence statements on n random variables which together imply that X1⊥X2, and such that no subset have this same implication. The proof relies ...
متن کاملConditional independence and natural conditional functions
The concept of conditional independence (CI) within the framework of natural conditional functions (NCFs) is studied. An NCF is a function ascribing natural numbers to possible states of the world; it is the central concept of Spohn's theory of deterministic epistemology. Basic properties of CI within this framework are recalled, and further results analogous to the results concerning probabili...
متن کاملA Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs
The conditional independence relations present in a data set usually admit multiple causal explanations — typically represented by directed graphs — which are Markov equivalent in that they entail the same conditional independence relations among the observed variables. Markov equivalence between directed acyclic graphs (DAGs) has been characterized in various ways, each of which has been found...
متن کاملMAMBO: Discovering Association Rules Based on Conditional Independencies
We present the Mambo algorithm for the discovery of association rules. Mambo is driven by conditional independence relations between the variables instead of the minimum support restrictions of algorithms like Apriori. We argue that making use of conditional independencies is an intuitively appealing way to restrict the set of association rules considered. Since we only have a finite sample fro...
متن کاملSearch for Additive Nonlinear Time Series Causal Models
Pointwise consistent, feasible procedures for estimating contemporaneous linear causal structure from time series data have been developed using multiple conditional independence tests, but no such procedures are available for non-linear systems. We describe a feasible procedure for learning a class of non-linear time series structures, which we call additive non-linear time series. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990